Networking and Communication Engineering

P. Raveendra Babu ¹, V. Praveen Kumar ², M. Samuel John ³, J. Ranga Rao ¹

Affiliations
1 Velagapudi Ramakrishna Siddhartha Engineering College in the Department of Computer Science & Engg., Vijayawada – 520 007, IN
2 Prasad V. Potluri Siddhartha Institute of Technology in the Department of Computer Science and Engineering, Vijayawada – 520 007, IN
3 Velagapudi Ramakrishna Siddhartha Engineering College in Department of Computer Applications, Vijayawada-520007, IN

Abstract

Efficient multimedia encryption algorithms play a key role in multimedia security protection. We introducing multiple Huffman Tables (MHT), which performs both compression and encryption by using multiple statistical models (i.e. Huffman coding tables) in the entropy encoder and multiple Huffman tables, are kept secret. A known-plaintext attack is presented to show that the MHTs used for encryption should be carefully selected to avoid the weak keys problem.

We then propose chosen-plaintext attacks on the basic MHT algorithm as well as the advanced scheme with random bit insertion. In addition, we suggest two empirical criteria for Huffman table selection, based on which we can simplify the stream cipher integrated scheme, while ensuring a high level of security.

Keywords

Cryptanalysis, Encryption, Entropy Encoding, Multiple Huffman Tables (MHT), Selective Encryption.

Full Text